- proof matching
- сопоставление машинного оттиска с пробным оттиском
Англо-русский словарь по полиграфии и издательскому делу. 2013.
proof matching
Смотреть что такое "proof matching" в других словарях:
Matching (Graphentheorie) — Die Theorie um das Finden von Matchings in Graphen ist in der diskreten Mathematik ein umfangreiches Teilgebiet, das in die Graphentheorie eingeordnet wird. Folgende Situation wird dabei betrachtet: Gegeben eine Menge von Dingen und zu diesen… … Deutsch Wikipedia
Impedance matching — In electronics, impedance matching is the practice of designing the input impedance of an electrical load (or the output impedance of its corresponding signal source) to maximize the power transfer and/or minimize reflections from the load.… … Wikipedia
Numerical 3-dimensional matching — is a strongly NP complete decision problem. It is given by three multisets of integers X, Y and Z, each containing k elements, and a bound b. The goal is to select a subset M of such that every integer in X, Y and Z occurs exactly once and that… … Wikipedia
Pattern matching — In computer science, pattern matching is the act of checking some sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact. The patterns generally have the form … Wikipedia
National Resident Matching Program — The National Resident Matching Program (NRMP) (or the Match[1]) is a United States based non profit non governmental organization created in 1952 to help match medical school students with residency programs. The NRMP is sponsored by the American … Wikipedia
Coalition-proof Nash equilibrium — The concept of coalition proof Nash equilibrium applies to certain noncooperative environments in which players can freely discuss their strategies but cannot make binding commitments [1]. It emphasizes the immunization to deviations that are… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician … Wikipedia
Maximum power transfer theorem — In electrical engineering, the maximum power transfer theorem states that, to obtain maximum external power from a source with a finite internal resistance, the resistance of the load must be equal to the resistance of the source as viewed from… … Wikipedia
Hall's marriage theorem — In mathematics, Hall s marriage theorem is a combinatorial result that gives the condition allowing the selection of a distinct element from each of a collection of finite sets. It was proved by Philip Hall (1935). Contents 1 Definitions and … Wikipedia
Nash equilibrium — A solution concept in game theory Relationships Subset of Rationalizability, Epsilon equilibrium, Correlated equilibrium Superset of Evolutionarily stable strategy … Wikipedia
